Short review of lattice basis reduction types and his applications. (Russian)
نویسنده
چکیده
This article presets a review of lattice lattice basis reduction types. Paper contains the main five types of lattice basis reduction: size reduced (weak Hermit), c-reduced, Lovasz condition, Hermit-Korkin-Zolotarev, Minkowski reduced. The article provides references to applications in: information theory (decoding of coding group in MIMO), calculus (minimize of the positive quadratic form), complexity theory and cryptanalysis of Merkle-Hellman cryptography (solving subset sum problems), algebra and control theory(solving system of linear diophantine equation), compiler theory (lattice based memory allocation), synthesize cryptographic and cryptanalysis in lattice based cryptography.
منابع مشابه
Lattice Problems and Their Reductions. (Russian)
This article presets a review of lattice problems. Paper contains the main eighteen problems with their reductions and referents to his cryptography application. As an example of reduction, we detail analyze connection between SVP and CVP. Moreover, we give an Ajtai theorem and demonstrate its role in lattice based cryptography.
متن کاملVoice of the Russian Truth... The thought of F. M. Dostoyevsky in the Russian intellectual-cultural tradition in the post-Kantian philosophical perspective
Cultivated for ages in the Russian intellectual-cultural tradition and community consciousness questions about Russia and formulated within them the questions about the thought and work of F.M. Dostoyevsky remain often symptomatically integrally linked, even mutually co-assuming. As, programmatically assumed by the author of the article, the post-Kantian philosophical perspective illustrates an...
متن کاملTesting Problems in Russian as a Foreign Language in a Technical University
Problems of theory and practice of the Russian as a foreign language testing for entrants in technical universities are considered. The benefits of test forms for controlling the foreign students’ skills in the Russian language during a hard time limit are presented. The structure and content of the tests, all types of tasks offered on the entrance and final examinations in the Russian languag...
متن کاملA Polynomial time Jacobi Method for Lattice Basis Reduction
Among all lattice reduction algorithms, the LLL algorithm is the first and perhaps the most famous polynomial time algorithm, and it is widely used in many applications. In 2012, S. Qiao [24] introduced another algorithm, the Jacobi method, for lattice basis reduction. S. Qiao and Z. Tian [25] improved the Jacobi method further to be polynomial time but only produces a Quasi-Reduced basis. In t...
متن کاملOn the Role of Derivational Processes in the Formation of Non-Taxonomic Classes of Lexical Units in Russian
The paper is focused on classes of lexical units which arise as a result of derivational processes – word formation and semantic transfers, acting either in isolation or together, on the basis of common semantic foundations that bind targets and sources of derivation. The lexical items which constitute the classes under study vary in their denotative characteristics and due to their categ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1210.6494 شماره
صفحات -
تاریخ انتشار 2012